Domain-dependent knowledge in answer set planning
نویسندگان
چکیده
منابع مشابه
Adding Domain Dependent Knowledge into Answer Set Programs for Planning
We investigate the methodology of utilizing domain dependent knowledge in solving the planning problem in answer set programming. We provide a classification of domain dependent knowledge, and for each class, a coding scheme. In this way, domain dependent knowledge can be encoded into an existing program. Experiments are conducted to illustrate the effect of adding domain dependent knowledge fo...
متن کاملPlanning with Different Forms of Domain-Dependent Control Knowledge - An Answer Set Programming Approach
In this paper we present a declarative approach to adding domain-dependent control knowledge for Answer Set Planning (ASP). Our approach allows different types of domain-dependent control knowledge such as hierarchical, temporal, or procedural knowledge to be represented and exploited in parallel, thus combining the ideas of control knowledge in HTN-planning, GOLOG-programming, and planning wit...
متن کاملAnswer Set Planning
In \answer set programming," solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets. This paper is about applications of this idea to planning.
متن کاملDomain- pecific Heuristics in Answer Set Programming
We introduce a general declarative framework for incorporating domain-specific heuristics into ASP solving. We accomplish this by extending the first-order modeling language of ASP by a distinguished heuristic predicate. The resulting heuristic information is processed as an equitable part of the logic program and subsequently exploited by the solver when it comes to non-deterministically assig...
متن کاملDomain-Specific Heuristics in Answer Set Programming
We introduce a general declarative framework for incorporating domain-specific heuristics into ASP solving. We accomplish this by extending the first-order modeling language of ASP by a distinguished heuristic predicate. The resulting heuristic information is processed as an equitable part of the logic program and subsequently exploited by the solver when it comes to non-deterministically assig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2006
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1183278.1183279